On the recursion depth of special tree traversal algorithms
نویسندگان
چکیده
منابع مشابه
On the Recursive Depth of Special Tree Traversal Algorithms
In this paper we are concerned with the analysis of special recursive algorithms for traversing the nodes of a planted plane tree (ordered tree ; planar tree) . Some by now classical results in this area are due to (de Bruijn, Knuth, and Rice, 1972 ; Knuth, 1973 ; Flajolet, 1981 ; Flajolet and Odlyzko, 1982 ; Flajolet, Raoult, and Vuillemin, 1979 ; Kemp, 1979) and others and are summarized in t...
متن کاملRecursion Depth Analysis for Specail Tree Traversal Algorithms
In this paper we are concerned with the analysis of special recursive algorithms for traversing the nodes of a planted plane tree (ordered tree ; planar tree) . Some by now classical results in this area are due to KNUTH [7], DE BRUIJN, KNUTH and RICE [1], FLAJOLET [2], FLAJOLET and ODLYZKO [3], FLAJOLET, RAOULT and VUILLEMIN [4], KEMP [6] and others and are summarized in the next few lines : T...
متن کاملthe effect of the utilization of electronic dictionaries on depth and breadth of vocabulary knowledge: a case of iranian efl learners
مطالعه حاضر تلاشی است برای بررسی تأثیرات به کارگیری فرهنگ لغات ، یکی از مهمترین ابزارهای یادگیری واژگان درفراگیری زبان خارجی، بر روی دانش لغوی. دراین تحقیق فرهنگ های الکترونیکی در قیاس با فرهنگ های چاپی مورد بررسی قرارگرفته اند که آیا این فرهنگ ها تاثیرقابل توجهی بر روی دوبعد کمی و کیفی دانش لغوی یعنی عمق و گستره لغات می گذارند. همچنین مشخص گردیده است که آیا تفاوت قابل ملاحظه ای میان عمق و گستر...
15 صفحه اولO(1) Time Algorithms for Combinatorial Generation by Tree Traversal
There are algorithms for generating combinatorial objects such as combinations, permutations and wellformed parenthesis strings in O(1) time per object in the worst case. Those known algorithms are designed based on the intrinsic nature of each problem, causing difficulty in applying a method in one area to the other. On the other hand, there are many results on combinatorial generation with mi...
متن کاملLocality-enhancing loop transformations for parallel tree traversal algorithms
Exploiting locality is critical to achieving good performance. For regular programs, which operate on dense arrays and matrices, techniques such as loop interchange and tiling have long been known to improve locality and deliver improved performance. However, there has been relatively little work investigating similar locality-improving transformations for irregular programs that operate on tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1987
ISSN: 0890-5401
DOI: 10.1016/0890-5401(87)90009-5